package Algoritmos;
import grafoS.*;

/**
 * Gcol is a program to help users to learn a little about graph coloring, in
 * this software, you can learn some coloring algorithms, and add your own
 * algorithm for coloring.You can also learn BFS and DFS search. This tool, also
 * support the .col format from DIMACS (Center for Discrete Mathematics and
 * Theoretical Computer Science), so you can import a big graph and use all the
 * algorithms. Copyright (C) <2015> Clóvis Daniel Souza Silva, Samuel Silva de
 * Souza, Professor Leonardo Sampaio Rocha.
 * 
* This program is free software: you can redistribute it and/or modify it under
 * the terms of the GNU General Public License as published by the Free Software
 * Foundation, either version 3 of the License, or (at your option) any later
 * version.
 * 
* This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
 * details.
 * 
* You should have received a copy of the GNU General Public License along with
 * this program. If not, see <http://www.gnu.org/licenses/>.
 * 
 * contact: projetoGrafos@gmail.com
 */

/** This class is used to model the class dynamically import to be used in interface, so that
 * there are two possibilities:
 * the first you can use only the graph to search
 * the second you can use graph and a start vertex.
 * all the User have to do is extend a class and implemtar their search logic
 * put there in the same folder. the program will load it dinamicamnet when starts .
 *@author Daniel
 *@author Samuel
 */
public class Algorithm {
    int[] vetorcor;
    
    /**
     *
     * @param p Any graph to be searched.
     * @param vertice the start vertex.
     * @return a vector containing the color for each vertex.
     */
    public int[] ReturnColor(Graph p, int vertice){
        return vetorcor;
    }

    /**
    * @param g Any graph to be searched.
    * @return a vector containing the color for each vertex.
    */
    public int[] ReturnColor(Graph g){
        return vetorcor;
    }
}
